Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder for a given BER requires only 1-2 dB higher signal-to-noise ratio (SNR) than the ML decoder.Comment: arXiv admin note: substantial text overlap with arXiv:1806.0395

Uniquely Decodable Ternary Codes for Synchronous CDMA Systems

In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K < K_{max}^t$ than any other known state-of-the-art ternary codes that offer low-complexity decoders in the noisy transmission. Moreover, we propose a simple decoder that uses only a few comparisons and can allow the user to uniquely recover the information bits. Compared to maximum likelihood (ML) decoder, which has a high computational complexity for even moderate code length, the proposed decoder has much lower computational complexity. We also derived the computational complexity of the proposed recursive decoder analytically. Simulation results show that the performance of the proposed decoder is almost as good as the ML decoder.Comment: arXiv admin note: text overlap with arXiv:1806.0395

Fast Decoder for Overloaded Uniquely Decodable Synchronous CDMA

We consider the problem of designing a fast decoder for antipodal uniquely decodable (errorless) code sets for overloaded synchronous code-division multiple access (CDMA) systems where the number of signals K_{max}^a is the largest known for the given code length L. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code length, the proposed decoder has a much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder only has a 1-2 dB degradation at BER of 10^{-3} when compared to ML

Low-Complexity Hybrid Precoding for Subarray Architecture mmWave MIMO Systems

Hybrid precoding for millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems has attracted much attention in recent years for subarray architecture compared to array architecture because of its low cost and low power consumption. This is due to the small number of required phase shifters in the subarray architecture. In this paper, we investigate the issue of hybrid precoding for the subarray architecture in narrowband mmWave MIMO systems. First, we derive the spectral efficiency of the subarray architecture with hybrid precoding and discuss the problem formulation. Then, we propose two low-complexity hybrid precoding algorithms for the subarray architecture for narrowband mmWave MIMO systems. In the first algorithm, the hybrid precoding matrix is divided into subarrays submatrices and each subarray submatrix is then divided into vectors. The analog precoding of each subarray is determined from the first vector of the subarray submatrix, which is then used to determine the elements of the digital precoder from all vectors in the subarray submatrix (vector by vector) using a simple maximum ratio combining (MRC) method. The proposed algorithm is called vector-by-vector (VBV) hybrid precoding. Finally, to further enhance the system performance, the proposed VBV precoding in the first algorithm is also combined with an iterative solution, and the resulting algorithm is called iterative VBV precoder. Simulation results verify that the proposed precoding algorithms outperform that of the successive interference cancellation-based subarray precoding and has a performance that is close to that obtained by the fully-connected spatially sparse precoding in various system settings, with lower complexity

Direct Conversion of Hybrid Precoding and Combining From Full Array Architecture to Subarray Architecture for mmWave MIMO Systems

Hybrid precoding and combining for millimeter-wave (mmWave) multiple-input multiple-output (MIMO) systems with subarray (SA) architecture is a promising technology for 6G because of their low complexity, cost, and power consumption compared to the full array (FA) architecture. This paper proposes an iterative algorithm for designing hybrid precoding and combining for the SA architecture. It is called direct conversion of iterative hybrid precoding and combining from FA to SA (DCIFS). The proposed algorithm involves an iterative process that begins by designing a hybrid precoding and combining matrix for the FA structure and then converts it into an SA matrix by setting certain entries to zero while achieving better performance. It does not depend on the antenna array geometry, unlike other techniques such as the orthogonal matching pursuit (OMP) hybrid precoding and combining approach. We investigate the proposed algorithm with two scenarios. In the first scenario, we use the proposed DCIFS scheme only at the base station (BS) and the iterative FA hybrid scheme at the mobile station (MS), whereas in the second, we use the proposed DCIFS scheme at both the BS and the MS. Simulation results demonstrate that the proposed design approach achieves a spectral efficiency comparable to that of the FA hybrid design counterpart, especially for a large system, while maintaining low complexity. For example, when SNR &#x003D; 0 dB and the number of transmitted streams ( $N_{s}$ ) &#x003D; 2, the proposed algorithm provides about 1.5 bps/Hz spectral efficiency gain compared to the OMP hybrid design for the first scenario. Moreover, when the number of iterations is low and the number of BS antenna and $N_{s}$ is high, the proposed approach outperforms the conventional SA hybrid design in terms of spectral efficiency with the same hardware complexity

Low-density spreading codes for NOMA systems and a Gaussian separability based design

Improved low-density spreading (LDS) code designs based on the Gaussian separability criterion are conceived. We show that the bit-error-rate (BER) hinges not only on the minimum distance criterion, but also on the average Gaussian separability margin. If two code sets have the same minimum distance, the code set having the highest Gaussian separability margin will lead to a lower BER. Based on the latter criterion, we develop an iterative algorithm that converges to the best known solution having the lowest BER. Our improved LDS code set outperforms the existing LDS designs in terms of its BER performance both for binary phase-shift keying (BPSK) and for quadrature amplitude modulation (QAM) transmissions. Furthermore, we use an appallingly low-complexity minimum mean-square estimation (MMSE) and parallel interference cancellation (PIC) (MMSE-PIC) technique, which is shown to have comparable BER performance to the potentially excessive-complexity maximum-likelihood (ML) detector.This MMSE-PIC algorithm has a much lower computational complexity than the message passingalgorithm (MPA)